Perfect Graphs for Domination Games
نویسندگان
چکیده
Let $$\gamma (G)$$ and _{t}(G)$$ be the domination number total of a graph G, respectively, let _g(G)$$ _{tg}(G)$$ game respectively. Then, G is _g$$ -perfect (resp. _{tg}$$ -perfect) if every induced subgraph F satisfies _g(F)=\gamma (F)$$ _{tg}(F)=\gamma _t(F)$$ ). A recursive characterization graphs derived. The yields polynomial recognition algorithm for graphs. It proved that minimally -imperfect has 2. All triangle-free are determined. also precisely $$\overline{2P_3}$$ -free cographs.
منابع مشابه
Roman domination perfect graphs
A Roman dominating function on a graphG is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u ∈ V (G) for which f(u) = 0 is adjacent to at least one vertex v ∈ V (G) for which f(v) = 2. The weight of a Roman dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The Roman domination number γR(G) of G is the minimum weight of a Roman dominating function on G. A Ro...
متن کاملUnique domination and domination perfect graphs
We review a characterization of domination perfect graphs in terms of forbidden induced subgraphs obtained by Zverovich and Zverovich [12] using a computer code. Then we apply it to a problem of unique domination in graphs recently proposed by Fischermann and Volkmann. 1 Domination perfect graphs Let G be a graph. A set D ⊆ V (G) is a dominating set of G if each vertex of G either belongs to D ...
متن کاملPerfect k-domination in graphs
Let k be a positive integer. A vertex subset D of a graph G = (V,E) is a perfect k-dominating set of G if every vertex v of G, not in D, is adjacent to exactly k vertices of D. The minimum cardinality of a perfect k-dominating set of G is the perfect k-domination number γkp(G). In this paper, we generalize perfect domination to perfect k-domination, where many bounds of γkp(G) are obtained. We ...
متن کاملDomination Games on Infinite Graphs
We consider two infinite games, played on a countable graph G given with an integer vertex labelling. One player seeks to construct a ray (a one-way infinite path) in G, so that the ray’s labels dominate or elude domination by an integer sequence being constructed by another player. For each game, we give a structural characterization of the graphs on which one player or the other can win, prov...
متن کاملPerfect graphs of strong domination and independent strong domination
Let γ(G), i(G), γS(G) and iS(G) denote the domination number, the independent domination number, the strong domination number and the independent strong domination number of a graph G, respectively. A graph G is called γi-perfect (domination perfect) if γ(H) = i(H), for every induced subgraph H of G. The classes of γγS-perfect, γSiS-perfect, iiS-perfect and γiS-perfect graphs are defined analog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2021
ISSN: ['0219-3094', '0218-0006']
DOI: https://doi.org/10.1007/s00026-021-00523-w